\hypertarget{class_task}{
\section{Task Class Reference}
\label{class_task}\index{Task@{Task}}
}


{\ttfamily \#include $<$task.h$>$}

\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\hyperlink{class_task_a3b2058bcb0e107d00c57a3d6accb2189}{Task} (bool stopOnFirstFound, bool stopOnBestFound)
\begin{DoxyCompactList}\small\item\em Constructor. \item\end{DoxyCompactList}\item 
\hyperlink{class_task_a0ca53354bdc006762a0fda68c64f7608}{Task} ()
\begin{DoxyCompactList}\small\item\em Constructor (stopOnFirstFound set to false). \item\end{DoxyCompactList}\item 
\hyperlink{class_task_a3ecf499ea35fb4a96853969a1e1cbbce}{$\sim$Task} ()
\begin{DoxyCompactList}\small\item\em Destructor. \item\end{DoxyCompactList}\item 
\hyperlink{class_configuration}{Configuration} $\ast$ \hyperlink{class_task_a2c184c1af80eb089bb45c6ed83d14fff}{solve} (\hyperlink{class_configuration}{Configuration} $\ast$start)
\begin{DoxyCompactList}\small\item\em The main business of this algorithm. \item\end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\begin{DoxyAuthor}{Author}
Vojta 
\end{DoxyAuthor}
\begin{DoxyDate}{Date}
04/01/10 
\end{DoxyDate}


\subsection{Constructor \& Destructor Documentation}
\hypertarget{class_task_a3b2058bcb0e107d00c57a3d6accb2189}{
\index{Task@{Task}!Task@{Task}}
\index{Task@{Task}!Task@{Task}}
\subsubsection[{Task}]{\setlength{\rightskip}{0pt plus 5cm}Task::Task (bool {\em stopOnFirstFound}, \/  bool {\em stopOnBestFound})}}
\label{class_task_a3b2058bcb0e107d00c57a3d6accb2189}


Constructor. 


\begin{DoxyParams}{Parameters}
\item[{\em stopOnFirstFound}]If true -\/ algorithm stops on first sollution found, else search whole space (to find the best sollution) \item[{\em stopOnBestFound}]If true -\/ algorithm stops on best sollution found (number of steps = number of figures on start) \end{DoxyParams}
\hypertarget{class_task_a0ca53354bdc006762a0fda68c64f7608}{
\index{Task@{Task}!Task@{Task}}
\index{Task@{Task}!Task@{Task}}
\subsubsection[{Task}]{\setlength{\rightskip}{0pt plus 5cm}Task::Task ()}}
\label{class_task_a0ca53354bdc006762a0fda68c64f7608}


Constructor (stopOnFirstFound set to false). 

\hypertarget{class_task_a3ecf499ea35fb4a96853969a1e1cbbce}{
\index{Task@{Task}!$\sim$Task@{$\sim$Task}}
\index{$\sim$Task@{$\sim$Task}!Task@{Task}}
\subsubsection[{$\sim$Task}]{\setlength{\rightskip}{0pt plus 5cm}Task::$\sim$Task ()}}
\label{class_task_a3ecf499ea35fb4a96853969a1e1cbbce}


Destructor. 



\subsection{Member Function Documentation}
\hypertarget{class_task_a2c184c1af80eb089bb45c6ed83d14fff}{
\index{Task@{Task}!solve@{solve}}
\index{solve@{solve}!Task@{Task}}
\subsubsection[{solve}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Configuration} $\ast$ Task::solve ({\bf Configuration} $\ast$ {\em start})}}
\label{class_task_a2c184c1af80eb089bb45c6ed83d14fff}


The main business of this algorithm. 


\begin{DoxyParams}{Parameters}
\item[{\em start}]Initial configuration \end{DoxyParams}
\begin{DoxyReturn}{Returns}
Sollution -\/ the best found \hyperlink{class_configuration}{Configuration} 
\end{DoxyReturn}


The documentation for this class was generated from the following files:\begin{DoxyCompactItemize}
\item 
src/\hyperlink{task_8h}{task.h}\item 
src/\hyperlink{task_8cpp}{task.cpp}\end{DoxyCompactItemize}
